Analysis of a parallel Schwarz algorithm for elliptic problems
نویسنده
چکیده
A parallel algorithm, which is derived directly from the Schwarz alternating algorithm with an overlapping domain decomposition, for solving boundary value problems of elliptic partial dierential equations is analyzed. A new general analysis framework dierent from Lions' ones is established to describe the recursive relations of error functions between approximate solutions and the exact solution at the dierent iterative steps. Some abstract theories on convergence and convergent rate of the synchronously parallel algorithm are established under dierent conditions. Ó 2000 Elsevier Science Inc. All rights reserved.
منابع مشابه
Parallel Numerical Algorithms Based on Overlappingschwarz Methods for Singularly Perturbedsemi - Linear Elliptic
Domain decomposition algorithms based on the Schwarz alternating method are developed for the numerical solution of singularly perturbed semi-linear elliptic problems. The emphasis is given to the description of two variants of the algorithm (multi-domain Schwarz alternating method and two-level Schwarz method) as well as their computer realization on a distributed memory multi-processor comput...
متن کاملA comparison of some domain decomposition and ILU preconditioned iterative methods for nonsymmetric elliptic problems
In recent years competitive domain decomposed preconditioned iterative tech niques have been developed for nonsymmetric elliptic problems In these tech niques a large problem is divided into many smaller problems whose requirements for coordination can be controlled to allow e ective solution on parallel machines A central question is how to choose these small problems and how to arrange the or...
متن کاملOn Schwarz Methods for Monotone Elliptic PDEs
The Schwarz Alternating Method was devised by H. A. Schwarz more than one hundred years ago to solve linear boundary value problems. It has garnered interest recently because of its potential as an efficient algorithm for parallel computers. See [Lio88], and [Lio89], the recent reviews [CM94], [LT94], and [XZ98], and the books [SBG96] and [QV99]. The literature for nonlinear problems is rather ...
متن کاملA Parallel Space-Time Algorithm
With the continued evolution of computing architectures towards many-core computing, algorithms that can effectively and efficiently use many cores are crucial. In this paper, we propose as a proof of principle, a parallel space–time algorithm that layers time parallelization together with a parallel elliptic solver to solve time dependent partial differential equations (PDEs). The parallel ell...
متن کاملOn Schwarz Alternating Methods for Nonlinear Elliptic Problems
The Schwarz Alternating Method is a method devised by H. A. Schwarz more than one hundred years ago to solve linear boundary value problems. It has garnered interest recently because of its potential as a very efficient algorithm for parallel computers. See the fundamental work of Lions in [7] and [8]. The literature on this method for the boundary value problem is huge, see the recent reviews ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Applied Mathematics and Computation
دوره 114 شماره
صفحات -
تاریخ انتشار 2000